On affine tropical F5 algorithms
نویسندگان
چکیده
Let K be a field equipped with valuation. Tropical varieties over can defined theory of Gröbner bases taking into account the valuation K. Because use valuation, tropical has proved to provide settings for computations polynomial rings p-adic that are more stable than classical bases. Beforehand, these strategies were only available homogeneous polynomials. In this article, we extend F5 strategy new definition in an affine setting. We also competitor adaptation F4 computations. numerical examples illustrate time-complexity and stability algorithm. its merits as first step before FGLM algorithm compute (classical) lex p-adics.
منابع مشابه
A Tropical F5 Algorithm
Let K be a field equipped with a valuation. Tropical varieties over K can be defined with a theory of Gröbner bases taking into account the valuation of K. While generalizing the classical theory of Gröbner bases, it is not clear how modern algorithms for computing Gröbner bases can be adapted to the tropical case. Among them, one of the most efficient is the celebrated F5 Algorithm of Faugère....
متن کاملKernel Affine Projection Algorithms
The combination of the famed kernel trick and affine projection algorithms (APA) yields powerful nonlinear extensions, named collectively here KAPA. This paper is a follow-up study of the recently introduced kernel leastmean-square algorithm (KLMS). KAPA inherits the simplicity and online nature of KLMS while reducing its gradient noise, boosting performance. More interestingly, it provides a u...
متن کاملOn optimal linear codes over F5
Let nq(k, d) be the smallest integer n for which there exists an [n, k, d]q code for given q, k, d. It is known that n8(4, d) = ∑3 i=0 ⌈ d/8i ⌉ for all d ≥ 833. As a continuation of Jones et al. [Electronic J. Combinatorics 13 (2006), #R43], we determine n8(4, d) for 117 values of d with 113 ≤ d ≤ 832 and give upper and lower bounds on n8(4, d) for other d using geometric methods and some exten...
متن کاملOn self-dual codes over F5
The purpose of this paper is to improve the upper bounds of the minimum distances of self-dual codes over F5 for lengths 22, 26, 28, 32 − 40. In particular, we prove that there is no [22, 11, 9] self-dual code over F5, whose existence was left open in 1982. We also show that both the Hamming weight enumerator and the Lee weight enumerator of a putative [24, 12, 10] self-dual code over F5 are un...
متن کاملA Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms
In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2021
ISSN: ['1095-855X', '0747-7171']
DOI: https://doi.org/10.1016/j.jsc.2019.10.012